Convex Polyhedra in R3 Spanning Ω(n4/3) Congruent Triangles
نویسندگان
چکیده
منابع مشابه
Line transversals of convex polyhedra in R3
We establish a bound of O(nk), for any ε > 0, on the combinatorial complexity of the setT of line transversals of a collection P of k convex polyhedra in R with a total of n facets, andpresent a randomized algorithm which computes the boundary of T in comparable expectedtime. Thus, when k ¿ n, the new bounds on the complexity (and construction cost) of Timprove upon the previous...
متن کاملIcosahedra Constructed from Congruent Triangles
It is possible to construct a figure in 3 dimensions which is combinatorially equivalent to a regular icosahedron, and whose faces are all congruent but not equilateral. Such icosamonohedra can be convex or nonconvex, and can be deformed continuously. A scalene triangle can construct precisely zero, one, or two convex icosamonohedra, and each occurs. Demonstrated here are two explicit convex ex...
متن کاملOn a Single Cell in an Arrangement of Convex Polyhedra in R3∗
We show that the combinatorial complexity of a single cell in an arrangement of k convex polyhedra in 3-space having n facets in total is O(nk), for any ε > 0, thus settling a conjecture of Aronov et al. [5]. We then extend our analysis and show that the overall complexity of the zone of a low-degree algebraic surface, or of the boundary of an arbitrary convex set, in an arrangement of k convex...
متن کاملMinimum-sum dipolar spanning tree in R3
In this paper we consider finding a geometric minimum-sum dipolar spanning tree in R, and present an algorithm that takes O(n log n) time using O(n) space, thus almost matching the best known results for the planar case. Our solution uses an interesting result related to the complexity of the common intersection of n balls in R, of possible different radii, that are all tangent to a given point...
متن کاملTiling a Triangle with Congruent Triangles
We investigate the problem of cutting a triangle ABC into N congruent triangles (the “tiles”), which may or may not be similar to ABC. We wish to characterize the numbers N for which some triangle ABC can be tiled by N tiles, or more generally to characterize the triples (N,T ) such that ABC can be N-tiled using tile T . In the first part of the paper we exhibit certain families of tilings whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2002
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3244